On Cartesian products of signed graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On polytopality of Cartesian products of graphs

We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove that a product of graphs is the graph of a simple polytope if and only if its factors are. On the other hand, we provide a general construction of polytopal products of a polytopal graph by a non-polytopal graph.

متن کامل

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

Embedding Cartesian Products of Graphs into De Bruijn Graphs Embedding Cartesian Products of Graphs into De Bruijn Graphs

(m 2) of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when n is greater than three or when n equals three and m is greater than two. For n = 3 and m = 2, we can show for wide classes of graphs that G cannot be...

متن کامل

Cartesian Products of Regular Graphs are Antimagic

An antimagic labeling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel [4] conjectured tha...

متن کامل

Total domination of Cartesian products of graphs

Let γt(G) and γpr(G) denote the total domination and the paired domination numbers of graph G, respectively, and let G ¤ H denote the Cartesian product of graphs G and H. In this paper, we show that γt(G)γt(H) ≤ 5γt(G ¤ H), which improves the known result γt(G)γt(H) ≤ 6γt(G ¤ H) given by Henning and Rall.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2021

ISSN: 0166-218X

DOI: 10.1016/j.dam.2021.03.023